Cost decompositions and the efficient subset
نویسندگان
چکیده
منابع مشابه
Tree Decompositions with Small Cost
The f -cost of a tree decomposition (fXi j i 2 Ig; T = (I; F )) for a function f : N ! R+ is de ned as P i2I f(jXij). This measure associates with the running time or memory use of some algorithms that use the tree decomposition. In this paper we investigate the problem to nd tree decompositions of minimum f -cost. A function f : N! R+ is fast, if for every i 2 N: f(i+1) 2 f(i). We show that fo...
متن کاملEfficient Subset and Superset Queries
The paper presents index structure for storing and querying sets called SetTrie. Besides the operations insert and search defined for ordinary tries, we introduce the operations for retrieving subsets and supersets of a given set from SetTrie tree. The performance of operations is analysed empirically in a series of experiments. The analysis shows that sets can be accessed in O(c ∗ |set|) time ...
متن کاملWorld-Set Decompositions: Expressiveness and Efficient Algorithms
Uncertain information is commonplace in real-world data management scenarios. The ability to represent large sets of possible instances (worlds) while supporting efficient storage and processing is an important challenge in this context. The recent formalism of worldset decompositions (WSDs) provides a space-efficient representation for uncertain data that also supports scalable processing. WSD...
متن کاملEfficient anisotropic α-Kernels decompositions and flows
The Laplacian raised to fractional powers can be used to generate scale spaces as was shown in recent literature. This was later extended for inhomogeneous diffusion processes and more general functions of the Laplacian and studied for the Perona-Malik case. In this paper we extend the results to the truly anisotropic Beltrami flow. We additionally introduce a technique for splitting up the wor...
متن کاملDynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
In this paper, we show that algorithms on tree decompositions can be made faster with the use of generalisations of fast subset convolution. Amongst others, this gives algorithms that, for a graph, given with a tree decomposition of width k, solve the dominated set problem in O(nk3) time and the problem to count the number of perfect matchings in O∗(2k) time. Using a generalisation of fast subs...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Omega
سال: 2016
ISSN: 0305-0483
DOI: 10.1016/j.omega.2015.09.004